A New Form of Circumscription for Logic Programs (Extended Abstract)
نویسنده
چکیده
Various semantics for logic programs with negation are described in terms of a dualized program together with additional axioms, some of which are second order formulas. A new axiom to represent \common sense" reasoning is proposed for logic programs. It is shown that the well-founded semantics and stable models are de nable with this axiom.
منابع مشابه
Compiling Prioritized Circumscription into Extended Logic Programs
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized circumscription. In this paper, we show theoretically that any circumscription whose theory contains both the domain closure axiom and the uniqueness of names axioms can always be compiled into an extended logic program...
متن کاملRelating Disjunctive Logic Programs to Default Theories
This paper presents the relationship between disjunctive logic programs and default theories. We rst show that Bidoit and Froidevaux's positivist default theory causes a problem in the presence of disjunctive information in a program. Then we present a correct transformation of disjunctive logic programs into default theories and show a one-to-one correspondence between the stable models of a p...
متن کاملExtended Logic Programs as Autoepistemic Theories
Recent research on applications of nonmonotonic reasoning to the semantics of logic programs demonstrates that some nonmonotonic formalisms are better suited for such use than others. Circumscription is applicable as long as the programs under consideration are stratiied. To describe the semantics of general logic programs without the stratiication assumption, one has to use autoepistemic logic...
متن کاملFrom Answer Set Logic Programming to Circumscription via Logic of GK
We rst embed Pearce s equilibrium logic and Ferraris s propositional general logic programs in Lin and Shoham s logic of GK a nonmonotonic modal logic that has been shown to include as special cases both Reiter s default logic in the propositional case and Moore s autoepistemic logic From this embedding we obtain a mapping from Ferraris s propositional general logic programs to circumscription ...
متن کاملTranslating Parallel Circumscription into Disjunctive Logic Programming
The semantics of disjunctive logic programs is based on minimal models. This makes atoms appearing in a disjunctive program false by default. In many cases this is highly desirable, but certain problems become awkward to formalize if all atoms are subject to minimization. Lifschitz’s parallel circumscription enables the use of varying and fixed atoms which eases the task of knowledge presentati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990